Verification of a Revised WAP Wireless Transaction Protocol
نویسندگان
چکیده
منابع مشابه
Modeling and Analyzing the WAP Class 2 Wireless Transaction Protocol Using Event-B
This paper presents an incremental formal development of the Wireless Transaction Protocol (WTP) in Event-B. WTP is part of the Wireless Application Protocol (WAP) architectures and provides a reliable request-response service. To model and verify the protocol, we use the formal technique Event-B which provides an accessible and rigorous development method. This interaction between modelling an...
متن کاملAnalysing the WAP Class 2 Wireless Transaction Protocol Using Coloured Petri Nets
Coloured Petri nets (CPNs) are used to specify and analyse the Class 2 Wireless Transaction Protocol (WTP). The protocol provides a reliable request/response service to the Session layer in the Wireless Application Protocol (WAP) architecture. When only a single transaction is considered occurrence graph and language analysis reveals 3 inconsistencies between the protocol and service speci cati...
متن کاملVerification of the WAP Transaction Layer Using the Model Checker SPIN
This report presents a formal methodology of formalizing and verifying theTransaction Layer Protocol (WTP) design in the Wireless Application Proto-col (WAP) architecture. Corresponding to the Class 2 Transaction Service (TR-Service) definition and the Protocol (TR-Protocol) design, two models at differentabstraction levels are built with a finite state automaton (FSA) forma...
متن کاملModelling the WAP Transaction Service using Coloured Petri Nets
The Wireless Application Protocol (WAP) is an architecture designed to support the provision of wireless Internet services to mobile users with hand-held devices. The Wireless Transaction Protocol is a layer of WAP that provides a reliable request/response service suited for Web applications. In this paper Coloured Petri nets are used to model and generate the possible primitive sequences of th...
متن کاملOn the verification of Wireless Transaction Protocol using SGM and RED
The exponentially large sizes of state-spaces have been a major obstacle in formal verification, which are due to high process concurrency, and large constants that are compared to clock variables and to discrete variables. We show how an intelligent permutation of reduction techniques and a good selection of data-structures can be used to decrease the effect of the above explosion factors. Fir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002